Most General First Order Theorems are not Recursively Enumerable
نویسنده
چکیده
منابع مشابه
Effectiveness and Godel Theorems in Fuzzy
It is well known that the notions of a "decidable subset" and "recursively enumerable subset" are basic one for classical logic. In particular, they are basic tools for the proof of the famous limitative theorems about the undecidability and incompleteness of first order logic. Then, the question of a suitable extension of such concepts to fuzzy set theory arises. A first proposal in such a dir...
متن کاملMonodic Fragments of Probabilistic First-Order Logic
By classical results of Abadi and Halpern, validity for probabilistic first-order logic of type 2 (ProbFO) is Π 1 -complete and thus not recursively enumerable, and even small fragments of ProbFO are undecidable. In temporal first-order logic, which has similar computational properties, these problems have been addressed by imposing monodicity, that is, by allowing temporal operators to be appl...
متن کاملOn the Degrees of Index Sets. Ii
In [8] we proved that the index-set corresponding to any recursively enumerable degree a is of the highest isomorphism-type possible for sets belonging to S3(a). From the proof of this result we derived Sacks' theorem [4] that the recursively enumerable degrees are dense. In the present paper we classify three other indexsets associated with any given recursively enumerable degree a, namely the...
متن کاملImpossibility Results for Logic dBerLog 2011 , Week 6
We prove that any sound logic for arithmetic must be incomplete. From this it follows that Hoare logic is incomplete too. We also see that the validity problem and the provability problem for rst-order predicate logic are undecidable problems. We see that any sound logic for second-order predicate logic must be incomplete. The crucial step in proving these results is establishing the expressive...
متن کاملThe Recursively Enumerable Degrees
Decision problems were the motivating force in the search for a formal definition of algorithm that constituted the beginnings of recursion (computability) theory. In the abstract, given a set A the decision problem for A consist of finding an algorithm which, given input n, decides whether or not n is in A. The classic decision problem for logic is whether a particular sentence is a theorem of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 147 شماره
صفحات -
تاریخ انتشار 1995